The Algebra of Flows in Graphs
نویسنده
چکیده
We define a contravariant functor K· from the category of finite graphs and graph morphisms to the category of finitely generated graded abelian groups and homomorphisms. For a graph X, an abelian group B, and a nonnegative integer j, an element of Hom(K(X), B) is a coherent family of B-valued flows on the set of all graphs obtained by contracting some (j − 1)-set of edges of X; in particular, Hom(K(X),R) is the familiar (real) “cycle-space” of X. We show that K·(X) is torsion-free and that its Poincaré polynomial is the specialization tTX(1/t, 1+ t) of the Tutte polynomial of X (here X has n vertices and k components). Functoriality of K· induces a functorial coalgebra structure on K·(X); dualizing, for any ring B we obtain a functorial B-algebra structure on Hom(K·(X), B). When B is commutative we present this algebra as a quotient of a divided power algebra, leading to some interesting inequalities on the coefficients of the above Poincaré polynomial. We also provide a formula for the theta function of the lattice of integer-valued flows in X, and conclude with ten open problems. 0. Introduction. Two ideas for defining algebraic invariants of graphs have been particularly successful up to now: these are the spectral and the K-theoretic approaches. The spectral theory begins by associating a (usually Hermitian) matrix M with a graph X , and proceeds by relating combinatorial structure in X to the spectral decomposition of M [3, 6, 10, 13]. The K-theoretic approach is the theory of the Tutte polynomial and its many interesting specializations [3, 7, 19, 20, 23]. A third method which seems promising but has been relatively neglected is the categorical approach. This idea is to define a functor from the category of graphs and graph morphisms into some (algebraic, geometric, topological,...) category, and to use these other structures to analyze the category of graphs. The most notable example of this approach so far is Walker’s functorial setting [24] for Lovász’s proof [14] of the Kneser conjecture; see also Björner’s survey [5]. Here we define such a functor K · into the category of finitely generated graded abelian groups and homomorphisms. The definition of K (X) is a formalization of Kirchhoff’s First Law on X and all of its images under repeated contractions of edges; for this reason we refer to K (X) as the “Kirchhoff group” of X . Imagine that the edges of X represent pipes, all of the same cross-sectional area, which are full of water (an incompressible fluid) and connected at the vertices. A flow of water in this system is represented by assigning a (real) velocity parallel to each edge; 1991 Mathematics Subject Classification. 05C99, 05E99, 18B99.
منابع مشابه
Computing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملDomination parameters of Cayley graphs of some groups
In this paper, we investigate domination number, $gamma$, as well as signed domination number, $gamma_{_S}$, of all cubic Cayley graphs of cyclic and quaternion groups. In addition, we show that the domination and signed domination numbers of cubic graphs depend on each other.
متن کاملOn zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملOn the energy of non-commuting graphs
For given non-abelian group G, the non-commuting (NC)-graph $Gamma(G)$ is a graph with the vertex set $G$ $Z(G)$ and two distinct vertices $x, yin V(Gamma)$ are adjacent whenever $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.
متن کاملIncidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کامل